#include<bits/stdc++.h>
using namespace std;
int n;
int gs[100010];
int zn[100010],top=0;
int ans;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> gs[i];
    }
    sort(gs+1,gs+1+n);
    for(int i=1;i<=n;i++){
        int cnt=1;
        while(gs[i+1]==gs[i]){
            cnt++;
            i++;
        }
        zn[++top] = cnt;
    }
    ans=n;
    for(int i=1;i<=top;i++){
        ans-=min(zn[i-1],zn[i]);
        zn[i-1]-=min(zn[i-1],zn[i]);
        zn[i]+=zn[i-1];
    }
    cout << ans << endl;
    return 0;
}